On the bent boolean fun tions whi h are symmetri
نویسنده
چکیده
منابع مشابه
Äääöòòòò Ùò Blockinøøóò× Óó Ööððúòø Úööööðð×
We onsider a fundamental problem in omputational learning theory: learning an arbitrary Boolean fun tion that depends on an unknown set of k out of n Boolean variables. We give an algorithm for learning su h fun tions from uniform random examples that runs in time roughly (n k ) ! !+1 ; where ! < 2:376 is the matrix multipli ation exponent. We thus obtain the rst polynomial fa tor improvement o...
متن کاملInterpolation and approximation in Taylor spaces
Barbara Zwi knagl1 and Robert S haba k2 Abstra t: The univariate Taylor formula without remainder allows to reprodu e a fun tion ompletely from ertain derivative values. Thus one an look for Hilbert spa es in whi h the Taylor formula a ts as a reprodu tion formula. It turns out that there are many Hilbert spa es whi h allow this, and they should be alled Taylor spa es. They have ertain reprodu ...
متن کاملModelling, Analysis and Simulation Computing complex Airy functions by numerical quadrature
Integral representations are onsidered of solutions of the Airy di erential equation w z w = 0 for omputing Airy fun tions for omplex values of z. In a rst method ontour integral representations of the Airy fun tions are written as non-os illating integrals for obtaining stable representations, whi h are evaluated by the trapezoidal rule. In a se ond method an integral representation is evaluat...
متن کاملUtility-Based De ision-Making in Wireless Sensor Networks
John Byers Gabriel Nasser byers s.bu.edu oman he s.bu.edu Computer S ien e Department Boston University Boston, MA 02215 O tober 17, 2000 Abstra t We onsider hallenges asso iated with appli ation domains in whi h a large number of distributed, networked sensors must perform a sensing task repeatedly over time. For the tasks we onsider, there are three signi ant hallenges to address. First, node...
متن کاملHardware/Software Co-Design Using Functional Languages
In previous work we have developed and prototyped a silion ompiler whi h translates a fun tional language (SAFL) into hardware. The te hniques we use require the restri tion (stati allo atability) that all re ursive alls are in a tail ontext. Here we extend this work, translating a fun tional language with general re ursion by mapping some fun tions dire tly to hardware and others to instru tio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007